The strict avalanche criterion randomness test

نویسندگان

Julio César Hernández Castro

José María Sierra

André Seznec

Antonio Izquierdo Manzanares

Arturo Ribagorda

چکیده

A new statistical test for randomness, the strict avalanche criterion (SAC) test, is presented, together with its results over some well-known generators in the literature. These results are analyzed and some possible applications of the test, as for measuring the strength of cryptographic primitives including block ciphers, stream ciphers and pseudorandom number generators, especially during the design and analysis phase, are detailed. Finally, the source code for a basic version of the SAC test is provided, which proves some of its other advantages: it is easy to implement, and very fast so well-suited for practical applications. © 2004 IMACS. Published by Elsevier B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New Analysis Methods on Strict Avalanche Criterion of S-Boxes

S-boxes (Substitution boxes) are keystones of modern symmetric cryptosystems (block ciphers, as well as stream ciphers). S-boxes bring nonlinearity to cryptosystems and strengthen their cryptographic security. They are used for confusion in data security An S-box satisfies the strict avalanche criterion (SAC), if and only if for any single input bit of the S-box, the inversion of it changes eac...

متن کامل

Some Statistical Simulation Results over the 128-bit Block Cipher CLEFIA

CLEFIA , a 128-bit block cipher designed using Diffusion Switching Mechanism (DSM) , was proposed by Sony Corporation in 2007. The attainment of some properties such as completeness, strict avalanche criterion and randomness cause the invigoration of confusion and diffusion properties in block ciphers. In this paper, we evaluate CLEFIA by considering these three important properties. For the ca...

متن کامل

New Bounds on the Number of Functions Satisfying the Strict Avalanche Criterion

In this paper we present asymptotic expressions for the number of functions satisfying the Strict Avalanche Criterion (SAC) with respect to one and two variables, previously developed by O’Connor. Cusick recently gave a conjecture for a lower bound on the number of functions satisfying the SAC. Here, we give a constructive proof for this conjecture. Moreover, we provide an improved lower bound.

متن کامل

The Strict Avalanche Criterion: Spectral Properties of Boolean Functions and an Extended Definition

A necessary and sufficient condition on the Walsh-spectrum of a boolean function is given, which implies that this function fulfills the Strict Avalanche Crit,erion. This condition is shown to be f W e d for a class of functions exhibiting simple spectral symmetries. Finally, an extended definition of the Strict Avalanche Criterion is proposed and the corresponding spectral characterization is ...

متن کامل